Meth DNA SAT SEG CLD DNA SAT SEG CLD DNA SAT SEG CLD DNA SAT
نویسنده
چکیده
The majority of ensemble creation algorithms use the full set of available features for its task. Feature selection for ensemble creation has not been carried out except for some work on random feature selection. In this paper we focus our attention on genetic based feature selection for ensemble creation. Our approach uses a genetic algorithm to search over the entire feature space. Subsets of features are used as input for ensemble creation algorithms. In this paper we compare boosting and bagging techniques for ensemble construction together with feature selection approaches. Also we compared the memory employed for the ensembles using the well-known C4.5 induction algorithm for ensemble construction. Our approach show more reliable ensembles with less than 50% of the total number of features employed.
منابع مشابه
FA-SAT Is an Old Satellite DNA Frozen in Several Bilateria Genomes
In recent years, a growing body of evidence has recognized the tandem repeat sequences, and specifically satellite DNA, as a functional class of sequences in the genomic "dark matter." Using an original, complementary, and thus an eclectic experimental design, we show that the cat archetypal satellite DNA sequence, FA-SAT, is "frozen" conservatively in several Bilateria genomes. We found differ...
متن کاملBrefeldin A enables synthesis of active lipoprotein lipase in cld/cld and castanospermine-treated mouse brown adipocytes via translocation of Golgi components to endoplasmic reticulum.
Brown adipocytes cultured from newborn combined-lipase-deficient (cld/cld) mice and castanospermine (CST)-treated 3T3-L1 adipocytes synthesize lipoprotein lipase (LPL) which is inactive and retained in the endoplasmic reticulum (ER) [Masuno, Blanchette-Mackie, Chernick and Scow (1990) J.Biol. Chem. 265, 1628-1638; Masuno, Blanchette-Mackie, Schultz, Spaeth, Scow and Okuda (1992) J. Lipid Res.33...
متن کاملA Parallel Algorithm for Solving Sat Problem Based on Dna Computing
In this paper, stickers are used to construct a solution space of DNA for the satisfiability (SAT) problem. Simultaneously DNA operations are applied in the sticker-based model to develop a DNA algorithm. The result of the proposed algorithm shows that the SAT problem is resolved with biological operation in the sticker-based model for solution space of sticker. Furthermore, this work presents ...
متن کاملHuman adipocytes from the subcutaneous superficial layer have greater adipogenic potential and lower PPAR-γ DNA methylation levels than deep layer adipocytes.
Human subcutaneous fat tissue consists of two layers, superficial adipose tissue (SAT) and deep adipose tissue (DAT). Some recent reports suggest that a disproportionate accumulation of DAT is related to obesity-associated metabolic complications. However, the differences in adipocyte function between SAT and DAT are unclear. To clarify the differences in human adipocyte characteristics between...
متن کاملA Space-Efficient Randomized DNA Algorithm for k-SAT
We present a randomized DNA algorithm for k-SAT based on the classical algorithm of Paturi et al. [8]. For an n-variable, m-clause instance of k-SAT (m > n), our algorithm finds a satisfying assignment, assuming one exists, with probability 1−e−α, in worst-case time O(kmn) and space O(2(1− 1 k ). This makes it the most space-efficient DNA k-SAT algorithm for k > 3 and k < n/ logα (i.e. the clau...
متن کامل